Axiomatizing Hybrid XPath with Data

In this paper we introduce sound and strongly complete axiomatizations for XPath with data constraints extended hybrid operators. First, present HXPath=, a multi-modal version of data, nominals the operator @. Then, an axiomatic system prove it is respect to class abstract models, i.e., models in which values are abstracted as equivalence relations. We general completeness result similar one presented in, e.g., [BtC06], that ensures certain extensions also complete. The systems can be obtained way cover large family languages over different classes frames, concrete examples. addition, investigate tree structures widely used practice. show complete, finitary, first-order axiomatization trees does not exist, propose two alternatives deal issue. finally filtrations status decidability satisfiability problem these languages.